Some Formulas for Spin Models on Distance-Regular Graphs

نویسندگان

  • Brian Curtin
  • Kazumasa Nomura
چکیده

A spin model is a square matrix W satisfying certain conditions which ensure that it yields an invariant of knots and links via a statistical mechanical construction of V. F. R. Jones. Recently F. Jaeger gave a topological construction for each spin model W of an association scheme which contains W in its Bose Mesner algebra. Shortly thereafter, K. Nomura gave a simple algebraic construction of such a Bose Mesner algebra N(W). In this paper we study the case W # A N(W), where A is the Bose Mesner algebra of a distance-regular graph. We show the following results. Let 1=(X, R) be a distance-regular graph of diameter d>1 such that the Bose Mesner algebra A of 1 satisfies W # A N(W) for some spin model W on X. Write W= i=0 tiAi , where Ai denotes the ith adjacency matrix. Set xi=t i&1 ti and p=x &1 1 x2 . Then xi= p x1 holds for all i. Moreover, the eigenvalues and the intersection numbers of 1 are rational functions of x1 and p. 1999 Academic Press

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distance-Based Topological Indices and Double graph

Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...

متن کامل

OPTIMAL ANALYSIS OF NON-REGULAR GRAPHS USING THE RESULTS OF REGULAR MODELS VIA AN ITERATIVE METHOD

In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of th...

متن کامل

OPTIMAL ANALYSIS OF NON-REGULAR GRAPHS USING THE RESULTS OF REGULAR MODELS VIA AN ITERATIVE METHOD

In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of the ...

متن کامل

Application of n-distance balanced graphs in distributing management and finding optimal logistical hubs

Optimization and reduction of costs in management of distribution and transportation of commodity are one of the main goals of many organizations. Using suitable models in supply chain in order to increase efficiency and appropriate location for support centers in logistical networks is highly important for planners and managers. Graph modeling can be used to analyze these problems and many oth...

متن کامل

On the distance eigenvalues of Cayley graphs

In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. B

دوره 75  شماره 

صفحات  -

تاریخ انتشار 1999